Dynamic capacity planning of hospital resources under COVID-19 uncertainty using approximate dynamic programming
نویسندگان
چکیده
COVID-19 pandemic has resulted in an inflow of patients into the hospitals and overcrowding healthcare resources. Healthcare managers increased capacities reactively by utilizing expensive but quick methods. Instead this reactive capacity expansion approach, we propose a proactive approach considering different realizations demand uncertainties future due to COVID-19. For purpose, stochastic dynamic model is developed find right amount increase most critical hospital Due problem size, solved with Approximate Dynamic Programming. Based on data collected large tertiary Turkey, experiments show that ADP performs better than benchmark myopic heuristic. Finally, sensitivity analysis performed explore impact epidemic dynamics cost parameters results.
منابع مشابه
Patient admission planning using Approximate Dynamic Programming
Tactical planning in hospitals involves elective patient admission planning and the allocation of hospital resource capacities. We propose a method to develop a tactical resource allocation and patient admission plan that takes stochastic elements into consideration, thereby providing robust plans. Our method is developed in an Approximate Dynamic Programming (ADP) framework and copes with mult...
متن کاملOptimization Model of Hirmand River Basin Water Resources in the Agricultural Sector Using Stochastic Dynamic Programming under Uncertainty Conditions
In this study, water management allocated to the agricultural sector’ was analyzed using stochastic dynamic programming under uncertainty conditions. The technical coefficients used in the study referred to the agricultural years, 2013-2014. They were obtained through the use of simple random sampling of 250 farmers in the region for crops wheat, barley, melon, watermelon and ruby grapes under ...
متن کاملProposed Approximate Dynamic Programming for Pathfinding under Visible Uncertainty
Continuing our preleminary work [2], we define the safest-with-sight pathfinding problems and explore its solution using techniques borrowed from measure-theoretic probability theory. We find a simple recursive definition for the probability that an ideal pathfinder will select an edge in a given scenario of an uncertain network where edges have probabilities of failure and vertices provide “vi...
متن کاملTactical Planning in Healthcare using Approximate Dynamic Programming
Tactical planning of resources in hospitals concerns elective patient admission planning and the intermediate term allocation of resource capacities. Its main objectives are to achieve equitable access for patients, to serve the strategically agreed number of patients, and to use resources efficiently. We propose a method to develop a tactical resource allocation and patient admission plan that...
متن کاملApproximate Disassembly Using Dynamic Programming
Most commercial anti-virus software uses signature based techniques to detect whether a file is infected by a virus or not. However, signature based detection systems are unable to detect metamorphic viruses, since such viruses change their internal structure from generation to generation. Previous work has shown that hidden Markov models (HMMs) can be used to detect metamorphic viruses. In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2023
ISSN: ['0160-5682', '1476-9360']
DOI: https://doi.org/10.1080/01605682.2023.2168570